Well-ordering of Algebra and Kruskal's Theorem Well-orderings of Algebra and Kruskal's Theorem
نویسنده
چکیده
We deene well-partial-orderings on abstract algebras and give their order types. For every ordinal in an initial segment of Bachmann hierarchy there is one and only one (up to isomorphism) algebra giving the ordinal as order type. As a corollary, we show Kruskal-type theorems for various structures are equivalent to well-orderedness of certain ordinals.
منابع مشابه
Well-foundedness of Term Orderings
Well-foundedness is the essential property of orderings for proving termination. We introduce a simple criterion on term orderings such that any term ordering possessing the subterm property and satisfying this criterion is well-founded. The usual path orders fulfil this criterion, yielding a much simpler proof of well-foundedness than the classical proof depending on Kruskal's theorem. Even mo...
متن کاملA note on spectral mapping theorem
This paper aims to present the well-known spectral mapping theorem for multi-variable functions.
متن کاملWhat's So Special About Kruskal's Theorem and the Ordinal To? A Survey of Some Results in Proof Theory
This paper consists primarily of a survey of results of Harvey Friedman about some proof theoretic aspects of various forms of Krusal's tree theorem, and in particular the connection with the ordinal Ƭo. We also include a fairly extensive treatment of normal functions on the countable ordinals, and we give a glimpse of Veblen Hierarchies, some subsystems of second-order logic, slow-growing and ...
متن کاملEncoding the Hydra Battle as a Rewrite System
In rewriting theory, termination of a rewrite system by Kruskal's theorem implies a theoretical upper bound on the complexity of the system. This bound is, however, far from having been reached by known examples of rewrite systems. All known orderings used to establish termination by Kruskal's theorem yield a multiply recursive bound. Furthermore, the study of the order types of such orderings ...
متن کاملOn a Duality Between Kruskal and Dershowitz Theorems
The article is mainly concernedwith the Kruskal tree theorem and the following observation: there is a duality at the level of binary relations between well and noetherian orders. The first step here is to extend Kruskal theorem from orders to binary relations so that the duality applies. Then, we describe the theorem obtained by duality and show that it corresponds to a theorem by Ferreira and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993